Correction to: Galois hulls of constacyclic codes over finite fields

نویسندگان

چکیده

A Correction to this paper has been published: https://doi.org/10.1007/s12095-022-00602-6

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constacyclic codes over finite fields

An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length lp are characterized, where p is the characteristic of the finite field and l is a prime different from p.

متن کامل

Skew constacyclic codes over Galois rings

We generalize the construction of linear codes via skew polynomial rings by using Galois rings instead of finite fields as coefficients. The resulting non commutative rings are no longer left and right Euclidean. Codes that are principal ideals in quotient rings of skew polynomial rings by a two sided ideals are studied. As an application, skew constacyclic self-dual codes over GR(4) are constr...

متن کامل

Galois LCD codes over finite fields

In this paper, we study the complementary dual codes in more general setting (which are called Galois LCD codes) by a uniform method. A necessary and sufficient condition for linear codes to be Galois LCD codes is determined, and constacyclic codes to be Galois LCD codes are characterized. Some illustrative examples which constacyclic codes are Galois LCD MDS codes are provided as well. In part...

متن کامل

Galois self-dual constacyclic codes

Generalizing Euclidean inner product and Hermitian inner product, we introduce Galois inner products, and study the Galois self-dual constacyclic codes in a very general setting by a uniform method. The conditions for existence of Galois self-dual and isometrically Galois self-dual constacyclic codes are obtained. As consequences, the results on self-dual, iso-dual and Hermitian self-dual const...

متن کامل

Some constacyclic codes over finite chain rings

For λ an n-th power of a unit in a finite chain ring we prove that λ-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some constacylic codes. We also study the α+pβconstacyclic codes of length p over the Galois ring GR(p, r).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cryptography and Communications

سال: 2022

ISSN: ['1936-2455', '1936-2447']

DOI: https://doi.org/10.1007/s12095-022-00602-6